A Greedy-based Network Planning Algorithm for Heterogeneous Smart Grid Infrastructures

Focus of this paper is the evaluation and optimization of automatic network planning algorithms considering different communication technologies supporting Smart Grid communication infrastructures. Therefore, a performance evaluation and sensitivity analysis of parameters of greedy-based algorithms solving the covering-location problem are implemented and analyzed in a discrete-event simulation environment. Based upon the presented results, an optimization based on the greedy algorithm is introduced considering Smart Grid technology and topology specific parameters. An evaluation for several real-world reference scenarios shows the influence of multi-layered and heterogeneous network topologies, which are typically used in Smart Gird ICT networks, including wired, wireless and Powerline Communication technologies. Depending on the technology, an optimization of the deployment level and number of network entities can be achieved and is presented by a reduction up to 30% for single-technology topologies and up to 10% for heterogeneous topologies. Keywords-network planning algorithm; covering location problem; heterogeneous infrastructures; smart grid.